Unmaximized Inclusion Type Conditions for Nonconvex Constrained Optimal Control Problems

نویسندگان

  • R. de Pinho
  • M. M. A. Ferreira
  • F. A. C. C. Fontes
چکیده

Necessary conditions of optimality in the form of an unmaximized Inclusion (UI) are derived for optimal control problems with state constraints. The conditions presented here generalize earlier optimality conditions to problems that may be nonconvex. The derivation of UI type conditions in the absence of the convexity assumption is of particular importance when deriving necessary conditions for constrained problems. We illustrate this feature by establishing, as an application, optimality conditions for problems that in addition to state constraints incorporate mixed state-control constraints. 1991 Mathematics Subject Classification. 49K15. The dates will be set by the publisher. Introduction In this paper we derive necessary conditions of optimality involving unmaximized Inclusion-type conditions for optimal control problems with pure state constraints and we report on some main applications. These subsume and substantially extend the results in [6], [8], [5] and [3]. The problem of interest is: (P)  Minimize g(x(0), x(1)) + ∫ 1 0 L(t, x(t), u(t))dt subject to ẋ(t) = f(t, x(t), u(t)) a.e. t ∈ [0, 1] h(t, x(t)) ≤ 0 a.e. t ∈ [0, 1] u(t) ∈ U(t) a.e. t ∈ [0, 1] (x(0), x(1)) ∈ C. Here g : R × R → R, L : [0, 1]× R × R → R, f : [0, 1]× R × R → R, h : [0, 1]× R → R are given functions, C ⊂ R × R a given set and U : [0, 1]⇒ R is a given multifunction. First order necessary conditions for the optimal control problem (P) when the data may be nonsmooth have undergone continuous development. Such conditions, written in the form of maximum principles, are based on

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A semidefinite relaxation scheme for quadratically constrained

  Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...

متن کامل

Necessary Conditions for Optimal Control Problems with State Constraints

Necessary conditions of optimality are derived for optimal control problems with pathwise state constraints, in which the dynamic constraint is modelled as a differential inclusion. The novel feature of the conditions is the unrestrictive nature of the hypotheses under which these conditions are shown to be valid. An Euler Lagrange type condition is obtained for problems where the multifunction...

متن کامل

Optimal Control of Nonconvex Discrete and Differential Inclusions

Optimization problems for discrete and diierential inclusions have many important applications and generalize both standard and nonstandard models in optimal control for open-loop and closed-loop control systems. In this paper we consider optimal control problems for dynamic systems governed by such inclusions with general endpoint constraints. We provide a variational analysis of diierential i...

متن کامل

Necessary Conditions for Multiobjective Optimal Control Problems with Free End-Time

Necessary conditions of optimality are derived for multiobjective optimal control problems with free end-time, in which the dynamics constraint is modeled as a nonconvex differential inclusion. The obtained results cover some previous results on necessary conditions for multiojective and single objective optimal control problems.

متن کامل

Solution of Bang-Bang Optimal Control Problems by Using Bezier Polynomials

In this paper, a new numerical method is presented for solving the optimal control problems of Bang-Bang type with free or fixed terminal time. The method is based on Bezier polynomials which are presented in any interval as $[t_0,t_f]$. The problems are reduced to a constrained problems which can be solved by using Lagrangian method. The constraints of these problems are terminal state and con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004